Fast Bound Consistency for the Global Cardinality Constraint
نویسندگان
چکیده
منابع مشابه
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملBound Consistency for Binary Length-Lex Set Constraints
The length-lex representation has been recently proposed for representing sets in Constraint Satisfaction Problems. The length-lex representation directly captures cardinality information, provides a total ordering for sets, and allows bound consistency on unary constraints to be enforced in time Õ(c), where c is the cardinality of the set. However, no algorithms were given to enforce bound con...
متن کاملThe Extended Global Cardinality Constraint: An Empirical Survey: Extended Abstract
The Extended Global Cardinality Constraint (EGCC) is an important component of constraint solving systems, since it is very widely used to model diverse problems. The literature contains many different versions of this constraint, which trade strength of inference against computational cost. In this paper, I focus on the highest strength of inference usually considered, enforcing generalized ar...
متن کاملImproved Algorithms for the Global Cardinality Constraint
We study the global cardinality constraint (gcc) and propose an O(nd) algorithm for domain consistency and an O(cn + dn) algorithm for range consistency, where n is the number of variables, d the number of values in the domain, and c an output dependent variable smaller than or equal to n. We show how to prune the cardinality variables in O(nd + n) steps, detect if gcc is universal in constant ...
متن کاملThe Extended Global Cardinality Constraint: An Empirical Survey: Extended
The Extended Global Cardinality Constraint (EGCC) is an important component of constraint solving systems, since it is very widely used to model diverse problems. The literature contains many different versions of this constraint, which trade strength of inference against computational cost. In this paper, I focus on the highest strength of inference usually considered, enforcing generalized ar...
متن کامل